Skip to main content

Learning Tabu Search for Combinatorial Optimization

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 509))

Included in the following conference series:

  • 629 Accesses

Abstract

In this paper, a new type of local search algorithm is proposed, called Learning Tabu Search and denoted \(\textit{LTS}\). It is assumed that any solution of the considered problem can be represented with a list of characteristics. \(\textit{LTS}\) involves a learning process relying on a trail system. The trail system is based on the idea that if some combinations of characteristics often belong to good solutions during the search process, such combinations of characteristics should be favored when generating new solutions. It will be showed that \(\textit{LTS}\) obtained promising results on a refueling problem in a railway network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Blum, C.: Ant colony optimization: introduction and recent trends. Phys. Life Rev. 2(4), 353–373 (2005)

    Article  Google Scholar 

  2. Dorigo, M., Birattari, M., Stuetzle, T.: Ant colony optimization—artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  3. Garey, M., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    Google Scholar 

  4. Gendreau M., Potvin, J.-Y.: Handbook of metaheuristics. In: International Series in Operations Research & Management Science, vol. 146, pp. 573–597. Springer, New York (2010)

    Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  MATH  Google Scholar 

  6. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    Book  MATH  Google Scholar 

  7. Schindl, D., Zufferey, N.: Solution methods for fuel supply of trains. Inf. Syst. Oper. Res. 51(1), 22–29 (2013)

    Google Scholar 

  8. Schindl, D., Zufferey, N.: A learning tabu search for a truck allocation problem with linear and nonlinear cost components. Nav. Res. Logistics 61(1), 42–45 (2015)

    Google Scholar 

  9. Zufferey, N.: Metaheuristics: some principles for an efficient design. Comput. Technol. Appl. 3(6), 446–462 (2012)

    Google Scholar 

  10. Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963–973 (2012)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicolas Zufferey .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zufferey, N., Schindl, D. (2015). Learning Tabu Search for Combinatorial Optimization. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17509-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17508-9

  • Online ISBN: 978-3-319-17509-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics